منابع مشابه
Some new D-optimal designs
We construct several new (v; r, 8; A) supplementary difference sets with v odd and T' + .5 = A + (v 1) /2. They give rise to D-optimal designs of order 2v. D-optimal designs of orders 158, 194, and 290 are constructed here for the first time. We also give an up to date survey of this class of supplementary difference sets in arbitrary Abelian groups of odd order v < 100. o. Introduction Supplem...
متن کاملMarginally restricted sequential D-optimal designs
In many experiments, not all explanatory variables can be controlled. When the units arise sequentially, different approaches may be used. The authors study a natural sequential procedure for “marginally restricted” D-optimal designs. They assume that one set of explanatory variables (x1) is observed sequentially, and that the experimenter responds by choosing an appropriate value of the explan...
متن کاملD-optimal designs via a cocktail algorithm
A fast new algorithm is proposed for numerical computation of (approximate) D-optimal designs. This cocktail algorithm extends the well-known vertex direction method (VDM; Fedorov 1972) and the multiplicative algorithm (Silvey, Titterington and Torsney, 1978), and shares their simplicity and monotonic convergence properties. Numerical examples show that the cocktail algorithm can lead to dramat...
متن کاملConstrained D-and D 1 -optimal Designs for Polynomial Regression
In the common polynomial regression model of degree m we consider the problem of determining the D-and D 1-optimal designs subject to certain constraints for the D 1-eeciencies in the models of degree m ? j; m ? j + 1; : : : ; m + k (m > j 0; k 0 given). We present a complete solution of these problems, which on the one hand allow a fast computation of the constrained optimal designs and on the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1996
ISSN: 0012-365X
DOI: 10.1016/0012-365x(96)00035-0